Rate Optimization for RIS-Aided mMTC Networks in the Finite Blocklength Regime
نویسندگان
چکیده
Reconfigurable intelligent surfaces (RISs) have become a promising candidate for the development of future mobile systems. In context massive machine-type communications (mMTC), RIS can be used to support transmission from group sensors collector node. Due short data packets, we focus on design maximizing weighted sum and minimum rates in finite blocklength regime. Under assumption non-orthogonal multiple access, successive interference cancelation is considered as decoding scheme mitigate interference. Accordingly, formulate optimizations non-convex problems propose two sub-optimal solutions based gradient ascent (GA) sequential optimization (SO) with semi-definite relaxation (SDR). GA, distinguish between Euclidean Riemannian gradients. For SO, derive concave lower bound throughput maximize it sequentially applying SDR. Numerical results show that SO outperform GA strategies relying classical Shannon capacity might inadequate mMTC networks.
منابع مشابه
Random Access Channel Coding in the Finite Blocklength Regime
The paper considers a random multiple access channel communication scenario with an unknown number of transmitters. The collection of active transmitters remains fixed during each epoch, but neither the transmitters nor the receiver know which subset of transmitters that is nor even the number of active transmitters. The receiver discerns from the channel output both the number of active transm...
متن کاملFading Channels: Capacity and Channel Coding Rate in the Finite-Blocklength Regime
Information-theoretic studies on the fundamental limits of communication over wireless fading channels typically rely on simplifying assumptions, such as perfect channel state information (CSI), infinite blocklength, and vanishing probability of error. Although these assumptions are reasonable for most of the current wireless communication systems, they may be inaccurate for next-generation wir...
متن کاملFinite-blocklength analysis of rate-compatible codes
This paper considers finite-blocklength achievability for rate-compatible codes. For a fixed number of messages, random coding analysis determines a sequence of achievable error probabilities for a sequence of blocklengths. However, traditional random coding achievability draws each code independently so that it does not show that a family of rate-compatible codes can achieve that sequence of e...
متن کاملChannel code blocklength and rate optimization for progressive image transmission
We investigate the problem of selecting blocklength and code rate for progressive image transmission, motivated by turbo coding methods where performance improves with blocklength. The problem is to balance the tradeoff among error protection, source coding rate, and delay. We propose a general performance measure for evaluating progressive transmission and use dynamic programming to determine ...
متن کاملFinite Blocklength Performance of Multi-Terminal Wireless Industrial Networks
This work focuses on the performance of multi-terminal wireless industrial networks, where the transmissions of all terminals are required to be scheduled within a tight deadline. The transmissions thus share a fixed amount of resources, i.e., symbols, while facing short blocklengths due to the low-latency requirement. We investigate two distinct relaying strategies, namely best relay selection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2023
ISSN: ['1558-2558', '1089-7798', '2373-7891']
DOI: https://doi.org/10.1109/lcomm.2022.3231717